Almost Boolean Functions: The Design of Boolean Functions by Spectral Inversion
نویسندگان
چکیده
The design of Boolean functions with properties of cryptographic significance is a hard task. In this paper, we adopt an unorthodox approach to the design of such functions. Our search space is the set of functions that possess the required properties. It is ‘Booleanness’ that is evolved.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملOmega-almost Boolean rings
In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.
متن کاملEfficient spectral method of identification of linear Boolean function
This paper discusses a problem of recognition of the Boolean function’s linearity. The article describes the spectral method of analysis of incompletely specified Boolean functions using the Walsh Transform. The linearity and nonlinearity play an important role in design of digital circuits. The analysis of the spectral coefficients’ distribution allows to determine the various combinatorial pr...
متن کاملThe Spectral Test of the Boolean Function Linearity
The paper discusses the problem of recognizing the Boolean function linearity. A spectral method of the analysis of Boolean functions using the Walsh transform is described. Linearity and nonlinearity play important roles in the design of digital circuits. The analysis of the distribution of spectral coefficients allows us to determine various combinatorial properties of Boolean functions, such...
متن کاملHaar Spectrum of Bent Boolean Functions
Bent Boolean functions play a very significant role in the design of strong symmetric cryptosystems. In this paper, we present an analysis of Bent functions in the Haar domain. We first present a brief overview of Bent Boolean functions and then derive expressions for the Haar spectrum of Bent functions. The Haar spectral coefficients of Bent functions are given in two ways namely; in terms of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computational Intelligence
دوره 20 شماره
صفحات -
تاریخ انتشار 2004